{tim dau T de co bieu thuc x[i] T x[i+1]... T x[n] = k}
program timdau;
const
	fi='timdau.inp';
    fo='timdau.out';
 	t='+-*/';
var
	f,g:text;
    tong,n,k:integer;
    a:array[1..10000] of integer;
    s:string;
procedure nhap;
var i:integer;
	begin
    assign(f,fi);
        reset(f);
        	readln(f,n,k);
            for i:=1 to n do
            	read(f,a[i]);
        close(f);
    end;

procedure xuat;
	begin
    end;

procedure dequy(d:integer;dau:string);
var
	i:integer;
    x:string;
	begin
    	if d>n then
        	begin
            	if tong=k then
                	begin
                    	delete(s,1,2);
                        writeln(s:5);
                        halt;
                	end;
            	exit;
            end;
        x:='';
        str(a[d],x);
        if dau='+' then
        	begin
        		tong:=tong+a[d];
                s:=s+' '+dau+' '+x;
            end;
        if dau='-' then
        	begin
        		tong:=tong-a[d];
                s:=s+' '+dau+' '+x;
            end;
        if dau='*' then
        	begin
        		tong:=tong*a[d];
                s:=s+' '+dau+' '+x;
            end;
        if dau='/' then
        	if tong mod a[d]=0 then
            	begin
                    tong:=tong div a[d];
                    s:=s+' '+dau+' '+x;
            	end
            else
            	exit;
        for i:=1 to 4 do
        	dequy(d+1,t[i]);
    end;

procedure xuly;
	begin
    	s:='';
    	dequy(1,t[1]);
    end;

begin
	nhap;
    xuly;
end.
